Bernoulli Collocation Polynomials Algorithm for Calculus of Variational Problems

Extended Zeilberger’s Algorithm for Identities on Bernoulli and Euler Polynomials

We present a computer algebra approach to proving identities on Bernoulli and Euler polynomials by using the extended Zeilberger’s algorithm given by Chen, Hou and Mu. The key idea is to use the contour integral definitions of the Bernoulli and Euler numbers to establish recurrence relations on the integrands. Such recurrence relations have certain parameter free properties which lead to the re...

Bernoulli polynomials

Hartley Series Direct Method for Variational Problems

The computational method based on using the operational matrix of anorthogonal function for solving variational problems is computeroriented. In this approach, a truncated Hartley series together withthe operational matrix of integration and integration of the crossproduct of two cas vectors are used for finding the solution ofvariational problems. Two illustrative...

Congruences concerning Bernoulli numbers and Bernoulli polynomials

Let {Bn(x)} denote Bernoulli polynomials. In this paper we generalize Kummer’s congruences by determining Bk(p−1)+b(x)=(k(p − 1) + b) (modp), where p is an odd prime, x is a p-integral rational number and p − 1 b. As applications we obtain explicit formulae for ∑p−1 x=1 (1=x ) (modp ); ∑(p−1)=2 x=1 (1=x ) (modp ); (p − 1)! (modp ) and Ar(m;p) (modp), where k ∈ {1; 2; : : : ; p− 1} and Ar(m;p) i...

A numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems

In this paper‎, two inverse problems of determining an unknown source term in a parabolic‎ equation are considered‎. ‎First‎, ‎the unknown source term is ‎estimated in the form of a combination of Chebyshev functions‎. ‎Then‎, ‎a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem‎. ‎For solving the problem‎, ‎the operational matrices of int...